Verification of the Futurebus+ Cache Coherence protocol: A case study in model checking
نویسندگان
چکیده
This paper presents a case study for automatic verification using the Communicating Sequential Processes formalism. The case study concerns the Futurebus+ cache coherency standard; we develop a formal model of the protocol and perform some verification tasks upon it. In the process of doing so, we extend the previous solution by developing a formal specification of cache coherence that is suitable for the verification of both directory and snooping based cache coherence protocols.
منابع مشابه
Verification of the Futurebus+ Cache Coherence Protocol
We used a hardware description language to construct a formal model of the cache coherence protocol described in the draft IEEE Futurebus+ standard. By applying temporal logic model checking techniques, we found several errors in the standard. The result of our project is a concise, comprehensible and unambiguous model of the protocol that should be useful both to the Futurebus+ Working Group m...
متن کاملVerifying a Network Invariant for All Configurations of the Futurebus+ Cache Coherence Protocol
In this paper we describe a network invariant for all configurations of the Futurebus+ Cache Coherence Protocol. The network invariant was computed with PAX and verified by a model checker. Using this invariant we are able to prove a specification of cache coherence correct for an arbitrary number of components on a single bus of the system. This specification includes a progress property not p...
متن کاملVeriication of the Futurebus+ Cache Coherence Protocol
We used a hardware description language to construct a formal model of the cache coherence protocol described in the draft IEEE Futurebus+ standard. By applying temporal logic model checking techniques, we found several errors in the standard. The result of our project is a concise, comprehensible and unambiguous model of the protocol that should be useful both to the Futurebus+ Working Group m...
متن کاملAutomatic Verification of Finite-State Concurrent Systems
School of Computer Science Carnegie Mellon University Pittsburgh, Pennsylvania 15213-3891, USA e-mail [email protected] Logical errors in finite-state concurrent systems such as sequential circuit designs and communication protocols are an important problem for computer scientists. They can delay getting a new product on the market or cause the failure of some critical device that is already in us...
متن کاملA Formal Verification Case Study for IEEE-P.896 Bus Arbiter by using A Model Checking Tool
In this paper, we describe a case study of formal verification for a computer bus arbitration controller by using the temporal logic of model checking. The implementation of the verification uses the Berkeley-VIS model checking system. Futurebus is a multiprocessor system bus with an arbitration and control mechanism. We describe the verification of the arbitration controller of "Futurebus'' (I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004